Modified Jarratt method with sixth-order convergence
نویسندگان
چکیده
منابع مشابه
A Modified Newton-Type Method with Sixth-Order Convergence for Solving Nonlinear Equations
In this paper, we present and analyze a sixth-order convergent method for solving nonlinear equations. The method is free from second derivatives and permits f'(x)=0 in some points. It requires three evaluations of the given function and two evaluations of its derivative in each step. Some numerical examples illustrate that the presented method is more efficient and performs better than classic...
متن کاملAn efficient three-step iterative method with sixth-order convergence for solving nonlinear equations
The aim of this paper is to construct an e¢ cient iterative method to solve nonlinear equations. This method is obtained from M. Javidis method (Appl. Math. Comput. 193 (2007) 360-365), which is third-order. The convergence order of new method is established to six and the e¢ ciency index is 1.5651. The Proposed method is compared with the second, third and sixth order methods. Some numerical ...
متن کاملA SIXTH ORDER METHOD FOR SOLVING NONLINEAR EQUATIONS
In this paper, we present a new iterative method with order of convergence eighth for solving nonlinear equations. Periteration this method requires three evaluations of the function and one evaluation of its first derivative. A general error analysis providing the eighth order of convergence is given. Several numerical examples are given to illustrate the efficiency and performance of the new ...
متن کاملAN ITERATIVE METHOD WITH SIX-ORDER CONVERGENCE FOR SOLVING NONLINEAR EQUATIONS
Modification of Newtons method with higher-order convergence is presented. The modification of Newtons method is based on Frontinis three-order method. The new method requires two-step per iteration. Analysis of convergence demonstrates that the order of convergence is 6. Some numerical examples illustrate that the algorithm is more efficient and performs better than classical Newtons method and ...
متن کاملModified frame algorithm and its convergence acceleration by Chebyshev method
The aim of this paper is to improve the convergence rate of frame algorithm based on Richardson iteration and Chebyshev methods. Based on Richardson iteration method, we first square the existing convergence rate of frame algorithm which in turn the number of iterations would be bisected and increased speed of convergence is achieved. Afterward, by using Chebyshev polynomials, we improve this s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 2009
ISSN: 0893-9659
DOI: 10.1016/j.aml.2009.06.022